Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
681	Submitted to the Annals of Statistics APPROXIMATION OF CONDITIONAL DENSITIES BY SMOOTH MIXTURES OF REGRESSIONS∗ By Andriy Norets† Princeton University Add to Reading List Source URL: www.economics.illinois.edu Language: English - Date: 2013-10-16 15:09:56 Integral calculus Differential calculus Information theory Conditioning Probability theory Kullback–Leibler divergence Normal distribution Derivative Integration by substitution Mathematical analysis Calculus Mathematics
682	Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009 Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-30 17:57:22 Constraint satisfaction problem Mathematics Computational complexity theory Mathematical optimization Probabilistic complexity theory Constraint satisfaction Combinatorial optimization Approximation algorithm Probabilistically checkable proof Theoretical computer science Constraint programming Applied mathematics
683	PHYSICAL REVIEW B 68, 155303 共2003兲 Quantum pumping in closed systems, adiabatic transport, and the Kubo formula Doron Cohen Department of Physics, Ben-Gurion University, Beer-Sheva 84105, Israel 共Received 8 April Add to Reading List Source URL: physics.bgu.ac.il Language: English - Date: 2003-10-18 18:00:00 Perturbation theory Conjugacy class Geometric phase Physics Quantum mechanics Born–Oppenheimer approximation
684	A Logical Toolbox for Knowledge Approximation (preliminary version) Frederic Koriche and Jean Sallantin LIRMM, UMR 5506, Universit@ Montpellier II CNRS 161, rue Ada[removed]Montpellier Cedex 5, France Add to Reading List Source URL: www.tark.org Language: English - Date: 2011-10-23 10:31:50 Model theory Logical truth Semantics Metalogic Modal logic Satisfiability Interpretation Epistemic modal logic Tautology Logic Mathematical logic Mathematics
685	2013 UI UNDERGRADUATE MATH CONTEST 1. Let a1 = 2 and an+1 = a2n − an + 1 for n = 1, 2, . . . . (i) Prove that the integers a1 , a2 , . . . are pairwise coprime (i.e., do not have a common prime factor). P 1 (ii) Prove Add to Reading List Source URL: www.math.illinois.edu Language: English - Date: 2013-03-03 21:07:15 Number theory Modular arithmetic Diophantine approximation Exponentials Mathematics Floor and ceiling functions Mathematical notation
686	Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2005-06-22 08:43:27 Constraint programming Computational complexity theory Constraint satisfaction problem 2-satisfiability Constraint satisfaction Approximation algorithm Logic in computer science Combinatorial optimization Linear programming Theoretical computer science Applied mathematics Mathematics
687	Unit Disk Graph Approximation∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-08-11 12:11:55 Graph Connectivity Topology Graph coloring Petersen graph Planar separator theorem Graph theory NP-complete problems Unit disk graph
688	CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:48:52 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming 2-satisfiability Theoretical computer science Computational complexity theory Mathematics
689	Local Approximation Schemes for Ad Hoc and Sensor ∗ Networks Fabian Kuhn Thomas Moscibroda Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-23 16:10:38 NP-complete problems Dominating set Unit disk graph Connected dominating set Graph coloring Independent set Polynomial-time approximation scheme Bidimensionality Domatic number Graph theory Theoretical computer science Computational complexity theory
690	On the Approximation Resistance of a Random Predicate Johan H˚ astad August 20, 2007 Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:58:20 Approximation algorithm Constraint programming Computational complexity theory Constraint satisfaction problem

UPDATE